#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL solve(LL x){
    LL sum=0;
    while(x>0){
        sum+=(x%10);x/=10;
    }
    return sum;
}
int main(void)
{
  	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n;cin>>n;
        for(LL i=n;i<=n+300;i++){
            LL temp=solve(i);

            if(__gcd(i,temp)>1){
                cout<<i<<"\n";
                break;
            }
        }
    }
return 0;
}
